Limiting shape for first-passage percolation models on random geometric graphs

نویسندگان

چکیده

Let a random geometric graph be defined in the supercritical regime for existence of unique infinite connected component Euclidean space. Consider first-passage percolation model with independent and identically distributed variables on component. We provide sufficient conditions asymptotic shape we show that is an ball. give some examples exhibiting result Bernoulli Richardson model. For further it converges weakly to nonstandard branching process joint limit large intensities slow passage times.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universality for first passage percolation on sparse random graphs

We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a uniform X logX-condition, we analyze the asymptotic distribution for the minimal weight path between a pair of typical vertices, as well the number of edges...

متن کامل

First passage percolation on random graphs with finite mean degrees

We study first passage percolation on the configuration model. Assuming that each edge has anindependent exponentially distributed edge weight, we derive explicit distributional asymptotics forthe minimum weight between two randomly chosen connected vertices in the network, as well as forthe number of edges on the least weight path, the so-called hopcount.We analyze the conf...

متن کامل

Competing first passage percolation on random regular graphs

We consider two competing first passage percolation processes started from uniformly chosen subsets of a random regular graph on N vertices. The processes are allowed to spread with different rates, start from vertex subsets of different sizes or at different times. We obtain tight results regarding the sizes of the vertex sets occupied by each process, showing that in the generic situation one...

متن کامل

First-passage percolation on random geometric graphs and an application to shortest-path trees

We consider Euclidean first-passage percolation on a large family of connected random geometric graphs in the d-dimensional Euclidean space encompassing various well-known models from stochastic geometry. In particular, we establish a strong linear growth property for shortest-path lengths on random geometric graphs which are generated by point processes. We consider the event that the growth o...

متن کامل

First passage percolation on the random graph

We study first passage percolation on the random graph Gp(N) with exponentially distributed weights on the links. For the special case of the complete graph this problem can be described in terms of a continuous time Markov chain and recursive trees. The Markov chain X(t) describes the number of nodes that can be reached from the initial node in time t. The recursive trees, which are uniform tr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Probability

سال: 2023

ISSN: ['1475-6072', '0021-9002']

DOI: https://doi.org/10.1017/jpr.2023.5